probabilistic automata

См. также в других словарях:

• Automata theory — Automata is defined as a system where energy, information and material is transformed, transmitted and used for performing some function without the direct participation of man .In theoretical computer science, automata theory is the study of… …   Wikipedia

• Probabilistic automaton — In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non deterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition… …   Wikipedia

• automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… …   Universalium

• Quantum finite automata — In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be… …   Wikipedia

• Digital probabilistic physics — is a branch of digital philosophy which holds that the universe exists as a nondeterministic state machine. The notion of the universe existing as a state machine was first postulated by Konrad Zuse s book Rechnender Raum. Adherents hold that the …   Wikipedia

• Michael O. Rabin — Michael Oser Rabin Born September 1, 1931 (1931 09 01) (age 80) Breslau …   Wikipedia

• Constraint automaton — In computer science, Constraint automata are a formalism to describe the behavior and possible data flow in coordination models[1]. It was introduced by Arbab et al.[2] as a variation of finite automata for model checking Reo connector circuits.… …   Wikipedia

• Read-only Turing machine — A read only Turing machine or Two way deterministic finite state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and can move in both directions across input, except cannot write to its input tape.… …   Wikipedia

• Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes …   Wikipedia

• Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes …   Wikipedia

• Erol Gelenbe — [ [http://dblp.uni trier.de/rec/bibtex/conf/iscis/Caglayan05 DBLP Record conf/iscis/Caglayan05 ] ] a Turkish academic, computer scientist, engineer and applied mathematician, is a scientific leader in the field of computer and network performance …   Wikipedia